Partial deduction in disjunctive logic programming
نویسندگان
چکیده
منابع مشابه
Partial Deduction in Disjunctive Logic Programming
CHIAKI SAKAMA AND HIROHISA SEKI y. This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal mode...
متن کاملNORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING
I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...
متن کاملPartial Deduction of Disjunctive Logic Programs: A Declarative Approach
This paper presents a partial deduction method for disjunctive logic programs. We rst show that standard partial deduction in logic programming is not applicable as it is in the context of disjunctive logic programs. Then we introduce a new partial deduction technique for disjunctive logic programs, and show that it preserves the minimal model semantics of positive disjunctive programs, and the...
متن کاملPartial Deduction for Structured Logic Programming
In this paper we discuss an extension of Partial Deduction in the framework of structured logic programs. The class of programs we consider includes statically configured systems such as blockand inheritance-based systems, as well as more dynamic configurations which support hypothetical reasoning and viewpoints. We show that the basic Partial Deduction definition can be extended to deal with a...
متن کاملDisjunctive Logic Programming as
Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00120-3